Lectures on noise sensitivity and percolation

نویسندگان

  • Christophe Garban
  • Jeffrey E. Steif
چکیده

The goal of this set of lectures is to combine two seemingly unrelated topics: • The study of Boolean functions, a field particularly active in computer science • Some models in statistical physics, mostly percolation The link between these two fields can be loosely explained as follows: a percolation configuration is built out of a collection of i.i.d " bits " which determines whether the corresponding edges, sites, or blocks are present or absent. In that respect, any event concerning percolation can be seen as a Boolean function whose input are precisely these " bits ". Over the last 20 years, mainly thanks to the computer science community, a very rich structure has emerged concerning the properties of Boolean functions. The first part of this course will be devoted to a description of some of the main achievements in this field. In some sense one can say, although this is an exaggeration, that computer scientists are mostly interested in the stability or robustness of Boolean functions. As we will see later in this course, the Boolean functions which " encode " large scale properties of critical percolation will turn out to be very sensitive to small perturbations. This phenomenon corresponds to what we will call noise sensitivity. Hence, the Boolean functions one wishes to describe here are in some sense orthogonal to the Boolean functions one encounters, ideally, in computer science. Remarkably, it turns out that the tools developed by the computer science community to capture the properties and stability of Boolean functions are also suitable for the study of noise sensitive functions. This is why it is worth us first spending some time on the general properties of Boolean functions. One of the main tools needed to understand properties of Boolean functions is Fourier analysis on the hypercube. Noise sensitivity will correspond to our Boolean function being of " high frequency " while stability will correspond to our Boolean function being of " low frequency ". We will apply these ideas to some other models from statistical mechanics as well; namely, first passage percolation and dynamical percola-tion. Some of the different topics here can be found (in a more condensed form) in [Gar10]. 5 Acknowledgements We wish to warmly thank the organizers David Ellwood, Charles Newman, Vladas Sidoravicius and Wendelin Werner for inviting us to give this course at the Clay summer school 2010 in Buzios. It was a …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noise sensitivity of Boolean functions and percolation , by Christophe Garban

The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....

متن کامل

Noise sensitivity of Boolean functions and percolation , by Christophe

The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....

متن کامل

Noise sensitivity of Boolean functions and percolation

The notion of noise sensitivity was introduced by Benjamini, Kalai, and Schramm in 1998 [3], in the context of percolation theory. Since then noise sensitivity has found applications in many fields, including concentration of measure, social choice theory, and theoretical computer science. Say we have n people voting for one of two candidates, D or R. One can write their choices as ω = (ω(1), ....

متن کامل

A mini course on percolation theory

These are lecture notes based on a mini course on percolation which was given at the Jyväskylä summer school in mathematics in Jyväskylä, Finland, August 2009. The point of the course was to try to touch on a number of different topics in percolation in order to give people some feel for the field. These notes follow fairly closely the lectures given in the summer school. However, some topics c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1102.5761  شماره 

صفحات  -

تاریخ انتشار 2011